Asymptotics and algebraicity of some generating functions
نویسندگان
چکیده
منابع مشابه
Automatic Asymptotics and Generating Functions
Computer algebra systems can be of help in the asymptotic analysis of combinatorial sequences. Several algorithms are presented, most of which have been implemented in Maple.
متن کاملSome bilinear generating functions.
In the present paper, the author applies some of his earlier results which extend the well-known Hille-Hardy formula for the Laguerre polynomials to certain classes of generalized hypergeometric polynomials in order to derive various generalizations of a bilinear generating function for the Jacobi polynomials proved recently by Carlitz. The corresponding results for the polynomials of Legendre,...
متن کاملOn composition of generating functions
In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...
متن کاملAsymptotics of Zeros for Some Entire Functions
We study the asymptotics of zeros for entire functions of the form sin z+ ∫ 1 −1 f(t)e dt with f belonging to a space X →֒ L1(−1, 1) possessing some minimal regularity properties.
متن کاملClusters, generating functions and asymptotics for consecutive patterns in permutations
Article history: Received 27 January 2012 Accepted 9 August 2012 Available online 5 September 2012 MSC: primary 05A05 secondary 05A15, 06A07
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1987
ISSN: 0001-8708
DOI: 10.1016/0001-8708(87)90015-6